New inertial relaxed method for solving split feasibilities

A Splitting-relaxed Projection Method for Solving the Split Feasibility Problem

The split feasibility problem (SFP) is to find x ∈ C so that Ax ∈ Q, where C is a nonempty closed convex subset of Rn, Q is a nonempty closed convex subset of Rm, and A is a matrix from Rn into Rm. One of successful methods for solving the SFP is Byrne’s CQ algorithm. However, to carry out the CQ algorithm, it is required that the closed convex subsets are simple and that the matrix norm is kno...

A New Method for Solving Constraint Satisfaction Problems

Many important problems in Artificial Intelligence can be defined as Constraint Satisfaction Problems (CSP). These types of problems are defined by a limited set of variables, each having a limited domain and a number of Constraints on the values of those variables (these problems are also called Consistent Labeling Problems (CLP), in which “Labeling" means assigning a value to a variable.) Sol...

A new method for solving fuzzy DEA models

A New Method for Solving Constraint Satisfaction Problems

Many important problems in Artificial Intelligence can be defined as Constraint Satisfaction Problems (CSP). These types of problems are defined by a limited set of variables, each having a limited domain and a number of Constraints on the values of those variables (these problems are also called Consistent Labeling Problems (CLP), in which “Labeling means assigning a value to a variable.) Solu...

A NEW ANALYTICAL METHOD FOR SOLVING FUZZY DIFFERENTIAL EQUATIONS

In the literature, several numerical methods are proposed for solvingnth-order fuzzy linear differential equations. However, till now there areonly two analytical methods for the same. In this paper, the fuzzy Kolmogorov'sdifferential equations, obtained with the help of fuzzy Markov modelof piston manufacturing system, are solved by one of these analytical methodsand illustrated that the obtai...